Global optimization for the Biaffine Matrix Inequality problem
نویسندگان
چکیده
منابع مشابه
Global optimization for the Biaffine Matrix Inequality problem
It has recently been shown that an extremely wide array of robust controller design problems may be reduced to the problem of finding a feasible point under a Biaffine Matrix Inequality (BMI) constraint. The BMI feasibility problem is the bilinear version of the Linear (Affine) Matrix Inequality (LMI) feasibility problem, and may also be viewed as a bilinear extension to the Semidefinite Progra...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولGlobal Optimization for the Phase Stability Problem
The Gibbs tangent plane criterion has become an important tool in determining the quality of obtained solutions to the phase and chemical equilibrium problem. The ability to determine if a postulated solution is thermodynamically stable with respect to perturbations in any or all of the phases is very useful in the search for the true equilibrium solution. Previous approaches have concentrated ...
متن کاملMultiobjective optimization problem with variational inequality constraints
We study a general multiobjective optimization problem with variational inequality, equality, inequality and abstract constraints. Fritz John type necessary optimality conditions involving Mordukhovich coderivatives are derived. They lead to Kuhn-Tucker type necessary optimality conditions under additional constraint qualifications including the calmness condition, the error bound constraint qu...
متن کاملGlobal Optimization for Satisfiability (SAT) Problem
The satisfiability (SAT) problem is a fundamental problem in mathematical logic, inference, automated reasoning, VLSI engineering, and computing theory. In this paper, following CNF and D N F local search methods, we introduce the Universal SAT problem model, UniSAT, which transforms the discrete SAT problem on Boolean space (0, l}"' into an unconstrained global optimization problem on real spa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 1995
ISSN: 0925-5001,1573-2916
DOI: 10.1007/bf01099648